/**
 * Created with IntelliJ IEDA.
 * Description:
 * User:86186
 * Date:2023-05-12
 * Time:23:37
 */

/**
 * BM32合并二叉树
 */

public class mergeTrees {
    public TreeNode mergeTrees (TreeNode t1, TreeNode t2) {
        // write code here
        if (t1 == null) {
            return t2;
        }
        if (t2 == null) {
            return t1;
        }
        TreeNode newTree = new TreeNode(t1.val + t2.val);
        newTree.left = mergeTrees(t1.left, t2.left);
        newTree.right = mergeTrees(t1.right, t2.right);
        return newTree;
    }
}
